Multiplicative Noise Removal Using L1 Fidelity on Frame Coefficients

نویسنده

  • and Nikolova M.
چکیده

We address the denoising of images contaminated with multiplicative noise, e.g. speckle noise. Classical ways to solve such problems are filtering, statistical (Bayesian) methods, variational methods, and methods that convert the multiplicative noise into additive noise (using a logarithmic function), apply a variational method on the log data or shrink their coefficients in a frame (e.g. a wavelet basis), and transform back the result using an exponential function. We propose a method composed of several stages: we use the log-image data and apply a reasonable under-optimal hard-thresholding on its curvelet transform; then we apply a variational method where we minimize a specialized hybrid criterion composed of an l data-fidelity to the thresholded coefficients and a Total Variation regularization (TV) term in the log-image domain; the restored image is an exponential of the obtained minimizer, weighted in a such way that the mean of the original image is preserved. Our restored images combine the advantages of shrinkage and variational methods and avoid their main drawbacks. Theoretical results on our hybrid criterion are presented. For the minimization stage, we propose a properly adapted fast scheme based on Douglas-Rachford splitting. The existence of a minimizer of our specialized criterion being proven, we demonstrate the convergence of the minimization scheme. The obtained numerical results clearly outperform the main alternative methods especially for images containing tricky geometrical structures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplicative Noise and Blur Removal by Framelet Decomposition and l1-Based L-Curve Method

This paper proposes a framelet based convex optimization model for multiplicative noise and blur removal problem. The main idea is to employ framelet expansion to represent the original image and use the variable decomposition to solve the problem. Because of the nature of multiplicative noise, we decompose the observed data into the original image variable and the noise variable to obtain the ...

متن کامل

Continuous dependence on coefficients for stochastic evolution equations with multiplicative Levy Noise and monotone nonlinearity

Semilinear stochastic evolution equations with multiplicative L'evy noise are considered‎. ‎The drift term is assumed to be monotone nonlinear and with linear growth‎. ‎Unlike other similar works‎, ‎we do not impose coercivity conditions on coefficients‎. ‎We establish the continuous dependence of the mild solution with respect to initial conditions and also on coefficients. ‎As corollaries of ...

متن کامل

A fast adaptive reweighted residual-feedback iterative algorithm for fractional-order total variation regularized multiplicative noise removal of partly-textured images

In this paper, we introduce a simple reweighted residual-feedback iterative (RRFI) algorithmwhich provides a general framework to solve the fractional-order total variation regularized models with different fidelity terms. We provide a sufficient condition for the convergence of this algorithm. As an application, we use this algorithm to solve the TV and fractional-order TV regularized models w...

متن کامل

Stochastic evolution equations with multiplicative Poisson noise and monotone nonlinearity

Semilinear stochastic evolution equations with multiplicative Poisson noise and monotone nonlinear drift in Hilbert spaces are considered‎. ‎The coefficients are assumed to have linear growth‎. ‎We do not impose coercivity conditions on coefficients‎. ‎A novel method of proof for establishing existence and uniqueness of the mild solution is proposed‎. ‎Examples on stochastic partial differentia...

متن کامل

Optimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling

This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009